Compiling Hierarchical Dependency Graph for Large- Span Musical Expressive Feature Analysis Using Multi- Scaling Probabilistic Graphical Models
نویسندگان
چکیده
Ren Gang, Xuchen Yang, Zhe Wen, Dave Headlam, Mark F. Bocko Dept. of Electrical and Computer Engineering, Edmund A. Hajim School of Engineering and Applied Sciences, Univ. of Rochester Dept. of Music Theory, Eastman School of Music, Univ. of Rochester Rochester, NY 14627, USA [email protected], [email protected],[email protected],[email protected], [email protected] Abstract—Music performance conveys profound music understanding and artistic expression in musical sound. These performance-related dimensions can be extracted from audio and encoded as musical expressive features, which is based on a highdimensional sequential data structure. In this paper we propose a structure learning based method using probabilistic graphical models that obtains a hierarchical dependency graph from musical expressive features. The hierarchical dependency graph we proposed serves as an intuitive visualization interface of the internal dependency patterns within feature data series and helps music scholars identify in-depthconceptual structures.
منابع مشابه
Implicational Scaling of Reading Comprehension Construct: Is it Deterministic or Probabilistic?
In English as a Second Language Teaching and Testing situations, it is common to infer about learners’ reading ability based on his or her total score on a reading test. This assumes the unidimensional and reproducible nature of reading items. However, few researches have been conducted to probe the issue through psychometric analyses. In the present study, the IELTS exemplar module C (1994) wa...
متن کاملAND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models
Compiling graphical models has recently been under intense investigation, especially for probabilistic modeling and processing. We present here a novel data structure for compiling weighted graphical models (in particular, probabilistic models), called AND/OR Multi-Valued Decision Diagram (AOMDD). This is a generalization of our previous work on constraint networks, to weighted models. The AOMD...
متن کاملThesis Proposal Parallel Learning and Inference in Probabilistic Graphical Models
Probabilistic graphical models are one of the most influential and widely used techniques in machine learning. Powered by exponential gains in processor technology, graphical models have been successfully applied to a wide range of increasingly large and complex real-world problems. However, recent developments in computer architecture, large-scale computing, and data-storage have shifted the f...
متن کاملCross-Document Co-Reference Resolution using Sample-Based Clustering with Knowledge Enrichment
Identifying and linking named entities across information sources is the basis of knowledge acquisition and at the heart of Web search, recommendations, and analytics. An important problem in this context is cross-document coreference resolution (CCR): computing equivalence classes of textual mentions denoting the same entity, within and across documents. Prior methods employ ranking, clusterin...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کامل